branching factor

The branching factor of a regular search tree has a decisive effect on the time complexity of a search algorithm.

正则搜索树的分支因数对算法的复杂度有决定性影响。

Branching factor of search process

搜索过程中的分支系数

Through the analysis of the data, using the A-branching factor analysis the different behaviors of ant system algorithm and improved algorithm in different parameters sets. verified the optimization of the search behavior through the use of the candidate list.

通过对仿真实验数据的分析，使用λ-分支因子法分析了基本蚁群算法与改进算法在不同的参数设置下的搜索行为的差异，验证了候选列表对于算法搜索行为的优化。

Branching Factor of Regular Search Trees

正则搜索树的分支因数

A geo-based search tree with branching factor K is constructed by recursively using cluster method to split scenes. The atomic region is defined on the leaf node of the search tree.

通过聚类算法递归的建立了一棵K叉树，将场景划分为由树的叶节点定义的若干原子区域。

Moreover, the analysis has indicated that the asymptotic heuristic branching factor is same as the brute-force branching factor.

分析还表明渐进启发分支因数与遍历分支因数相同。

Traditional analysis use accuracy as character of the heuristic function and the function's effect is to decrease the actual branching factor.

传统的分析以启发值的精确性作为启发函数的特征，启发函数的作用相当于减小有效的分支因数。